Parallel adaptive FETI‐DP using lightweight asynchronous dynamic load balancing
نویسندگان
چکیده
منابع مشابه
Dynamic Load Balancing in a Lightweight Adaptive Parallel Multigrid PDE Solver
A parallel version of an adaptive multigrid solver for partial diierential equations is considered. The main emphasis is put on the load balancing algorithm to distribute the adaptive grids at runtime. The background and some applications of space-lling curves are discussed, which are later on used as the basic principle of the load-balancing heuristic. A tight integration of space-lling curves...
متن کاملDynamic Load Balancing for Parallel
Adaptive mesh reenement is a key problem in large-scale numerical calculations. The need of adaptive mesh reenement could introduce load imbalance among processors, where the load measures the amount of work required by reenement itself as well as by numerical calculations thereafter. We present a dynamic load balancing algorithm to ensure that the work load are balanced while the communication...
متن کاملAsynchronous Dynamic Load Balancing of Tiles
Many scienti c computations have work-intensive kernels consisting of nested loops with a regular stencil of data dependences. For such loop nests, tiling [3] is a well-known compiler optimization that can help achieve e cient parallelism. For a loop nest of depth K, tiling partitions the K-dimensional space of iterations into regular size and shape chunks of work. These tiles are allocated to ...
متن کاملDynamic Load Balancing for Parallel Adaptive Mesh Refinement
A key step in the nite element method is to generate a high quality mesh that is as small as possible for an input domain. Several meshing methods and heuristics have been developed and implemented. Methods based on advancing front, Delaunay triangulations, and quadtrees/octrees are among the most popular ones. Advancing front uses simple data structures and is eecient. Unfortunately, in genera...
متن کاملAsynchronous Random Polling Dynamic Load Balancing
Many applications in parallel processing have to traverse large, implicitly deened trees with irregular shape. The receiver initiated load balancing algorithm random polling has long been known to be very eecient for these problems in practice. For any > 0, we prove that its parallel execution time is at most (1 +)Tseq=P + O(Tatomic + h(1 +Trout +T split)) with high probability, where Trout, T ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2019
ISSN: 0029-5981,1097-0207
DOI: 10.1002/nme.6237